Excited random walks with Markovian cookie stacks
نویسندگان
چکیده
منابع مشابه
Skip-free Random Walks with Markovian Increments
Let (ξk, k ≥ 0) be a Markov chain on {−1, +1} with ξ0 = 1 and transition probabilities P (ξk+1 = 1| ξk = 1) = a and P (ξk+1 = −1| ξk = −1) = b < a. Set X0 = 0, Xn = ξ1 + · · ·+ ξn and Mn = max0≤k≤n Xk. We prove that the process 2M − X has the same law as that of X conditioned to stay non-negative. Pitman’s representation theorem [19] states that, if (Xt, t ≥ 0) is a standard Brownian motion and...
متن کاملExcited Random Walk in a Markovian Environment
One dimensional excited random walk has been extensively studied for bounded, i.i.d. cookie environments. In this case, many important properties of the walk including transience or recurrence, positivity or non-positivity of the speed, and the limiting distribution of the position of the walker are all characterized by a single parameter δ, the total expected drift per site. In the more genera...
متن کاملPath-probability density functions for semi-Markovian random walks.
In random walks, the path representation of the Green's function is an infinite sum over the length of path probability density functions (PDFs). Recently, a closed-form expression for the Green's function of an arbitrarily inhomogeneous semi-Markovian random walk in a one-dimensional (1D) chain of L states was obtained by utilizing path-PDFs calculations. Here we derive and solve, in Laplace s...
متن کاملExcursions and Occupation times of Critical Excited Random Walks
We consider excited random walks (ERWs) on integers in i.i.d. environments with a bounded number of excitations per site. The emphasis is primarily on the critical case for the transition between recurrence and transience which occurs when the total expected drift δ at each site of the environment is equal to 1 in absolute value. Several crucial estimates for ERWs fail in the critical case and ...
متن کاملRandom Walks with Random Projections
Random projections have been widely used for dimensionality reduction of high dimensional problems. In this paper we show how to compute some popular random walk based proximity measures (hitting and commute times, personalized pagerank) using random projections in undirected graphs. A number of important graph-based real world applications such as image segmentation, collaborative filtering in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
سال: 2017
ISSN: 0246-0203
DOI: 10.1214/16-aihp761